Mining significant change patterns in multidimensional spaces

نویسندگان

  • Ronnie Alves
  • Joel Ribeiro
  • Orlando Belo
چکیده

In this paper, we present a new OLAP Mining method for exploring interesting trend patterns. Our main goal is to mine the most (TOP-K) significant changes in Multidimensional Spaces (MDS) applying a gradientbased cubing strategy. The challenge is then finding maximum gradient regions, which maximises the task of detecting TOP-K gradient cells. Several heuristics are also introduced to prune MDS efficiently. In this paper, we motivate the importance of the proposed model, and present an efficient and effective method to compute it by • evaluating significant changes by means of pushing gradient search into the partitioning process • measuring Gradient Regions (GR) spreadness for data cubing • measuring Periodicity Awareness (PA) of a change, assuring that it is a change pattern and not only an isolated event • devising a Rank Gradient-based Cubing to mine significant change patterns in MDS.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constrained Cube Lattices for Multidimensional Database Mining

In multidimensional database mining, constrained multidimensional patterns differ from the well-known frequent patterns from both conceptual and log ical points of view because of a common structure and the ability to support various types of constraints. Classical data mining techniques are based on the power set lattice of binary attribute values and, even adapted, are not suitable when addre...

متن کامل

Multidimensional Sequential Pattern Mining

Data mining is the task of discovering interesting patterns from large amounts of data. There are many data mining tasks, such as classification, clustering, association rule mining, and sequential pattern mining. Sequential pattern mining is the process of finding the relationships between occurrences of sequential events, to find if there exists any specific order of the occurrences. It is a ...

متن کامل

Multidimensional Web Access Pattern Tree (MD-WAP Tree)

Mining frequent web access patterns from large data (web log) is one significant application of sequential pattern mining. Web access patterns are set of frequent sub sequences that are useful to know user behaviour in real time in order to make dynamic decisions. Techniques for extracting web access patterns from data available in two flavours: apriori based and non apriori based (tree based)....

متن کامل

Cube Lattices: A Framework for Multidimensional Data Mining

Constrained multidimensional patterns differ from the well-known frequent patterns from a conceptual and logical points of view because they are provided with a common structure and support various types of constraints. Classical data mining techniques are based on the power set lattice of binary attributes and, even extended, are not suitable when addressing the discovery of constrained multid...

متن کامل

Treillis Relationnel : Une Structure Algébrique pour le Data Mining Multi-Dimensionnel

Constrained multidimensional patterns differ from the well known frequent patterns from a conceptual and logical points of view because they are structured and support various types of constraints. Classical data mining techniques are based on the power set lattice and, even extended, are not suitable when addressing the discovery of multidimensional patterns. In this paper we propose a foundat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJBIDM

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2009